Scaling analysis of multiple-try MCMC methods
نویسندگان
چکیده
منابع مشابه
Scaling analysis of delayed rejection MCMC methods
In this paper, we study the asymptotic efficiency of the delayed rejection strategy. In particular, the efficiency of the delayed rejection Metropolis-Hastings algorithm is compared to that of the regular Metropolis algorithm. To allow for a fair comparison, the study is carried under optimal mixing conditions for each of these algorithms. After introducing optimal scaling results for the delay...
متن کاملStochastic Subgradient MCMC Methods
Many Bayesian models involve continuous but non-differentiable log-posteriors, including the sparse Bayesian methods with a Laplace prior and the regularized Bayesian methods with maxmargin posterior regularization that acts like a likelihood term. In analogy to the popular stochastic subgradient methods for deterministic optimization, we present the stochastic subgradient MCMC for efficient po...
متن کاملOptimal Scaling for Partially Updating Mcmc Algorithms
In this paper we shall consider optimal scaling problems for highdimensional Metropolis–Hastings algorithms where updates can be chosen to be lower dimensional than the target density itself. We find that the optimal scaling rule for the Metropolis algorithm, which tunes the overall algorithm acceptance rate to be 0.234, holds for the so-called Metropolis-within-Gibbs algorithm as well. Further...
متن کاملEffects of Far- and Near-Field Multiple Earthquakes on the RC SDOF Fragility Curves Using Different First Shock Scaling Methods
Typically, to study the effects of consecutive earthquakes, it is necessary to consider definite intensity levels of the first shock. Methods commonly used to define intensity involve scaling the first shock to a specified maximum interstorey drift. In this study the structure’s predefined elastic spectral acceleration caused by the first shock is also considered for scaling. This study aims to...
متن کاملSupervised classification using MCMC methods
This paper addresses the problem of supervised classification using general Bayesian learning. General Bayesian learning consists of estimating the unknown class-conditional densities from a set of labelled samples. However, the estimation requires to evaluate intractable multidimensional integrals. This paper studies an implementation of general Bayesian learning based on MCMC methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2012
ISSN: 0304-4149
DOI: 10.1016/j.spa.2011.11.004